A Partial Type Checking Algorithm for Type:Type
نویسندگان
چکیده
منابع مشابه
A Partial Type Checking Algorithm for Type: Type
We analyze a partial type checking algorithm for the inconsistent domain-free pure type system Type:Type (λ∗). We show that the algorithm is sound and partially complete using a coinductive specification of algorithmic equality. This entails that the algorithm will only diverge due to the presence of diverging computations, in particular it will terminate for all typeable terms.
متن کاملa cauchy-schwarz type inequality for fuzzy integrals
نامساوی کوشی-شوارتز در حالت کلاسیک در فضای اندازه فازی برقرار نمی باشد اما با اعمال شرط هایی در مسئله مانند یکنوا بودن توابع و قرار گرفتن در بازه صفر ویک می توان دو نوع نامساوی کوشی-شوارتز را در فضای اندازه فازی اثبات نمود.
15 صفحه اولAn Algorithm for Type-Checking Dependent Types
We present a simple type-checker for a language with dependent types and let expressions, with a simple proof of correctness.
متن کاملA type checking algorithm for qualified session types
We present a type checking algorithm for establishing a session-based discipline in the pi calculus of Milner, Parrow and Walker. Our session types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times; afterwards they evolve as unrestricted channels. Session protocols are described by a type constru...
متن کاملA Formal Description Of A Type Checking Algorithm
In type system theory, a program variable can assume a range of values during the execution of a program. In a statically typed language, every expression of the language is assigned a type at compile time. There are many advantages to having a statically type-checked language including provision of earlier information on programming errors, documenting component interfaces, eliminating the nee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2011
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2011.02.013